منابع مشابه
Anonymous Signcryption in Ring Signature Scheme over Elliptic Curve Cryptosystem
This study presents an anonymous signcryption scheme based on the elliptic curve cryptosystem, which combines the properties of elliptic curve cryptosystem and ring signature. While the signers are endowed with anonymity through the technique of ring signature, the elliptic curve cryptosystem achieves the advantages of high security, low computation load, and small bandwidth requirements. To in...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملIdeal 9th-order Multigrades and Letac's Elliptic Curve
By showing that the elliptic curve (x2 13)(y2 13) = 48 has infinitely many rational points, we prove that Letac's construction produces infinitely many genuinely different ideal 9th-order multigrades. We give one (not very small) new example, and, by finding the Mordell-Weil group of the curve, show how to find all examples obtainable by Letac's method.
متن کاملPlatform Independent Elliptic Curve Cryptography over
Elliptic curve cryptography has long since moved into several wellknown standards like IEEE’s 1363, SEC and X9.62. With its small key sizes it is just right for many crypto applications, in particular for mobile computing and communication devices. To make ECC easily available for all these different applications, a highly efficient and platformindependent implementation of ECC is necessary. Th...
متن کاملComputing the endomorphism ring of an ordinary elliptic curve over a finite field
We present two algorithms to compute the endomorphism ring of an ordinary elliptic curve E defined over a finite field Fq . Under suitable heuristic assumptions, both have subexponential complexity. We bound the complexity of the first algorithm in terms of log q , while our bound for the second algorithm depends primarily on log |DE |, where DE is the discriminant of the order isomorphic to En...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Open Problems in Computer Science and Mathematics
سال: 2013
ISSN: 1998-6262
DOI: 10.12816/0006175